Algebraic Complexity Theory
نویسنده
چکیده
منابع مشابه
Nicholas Pippenger Algebraic Complexity Theory
Algebraic complexity theory, the study of the minimum number of operations suficient o perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and ...
متن کاملConstructing elusive functions with help of evaluation mappings
We introduce a general concept of complexity and a polynomial type algebraic complexity of a polynomial mapping. The notion of polynomial type algebraic complexity encompasses the determinantal complexity. We analyze the relation between polynomial type algebraic complexities and elusive functions. We study geometric-algebraic properties of polynomial type computational complexities. We present...
متن کاملTowards an algebraic natural proofs barrier via polynomial identity testing
We observe that a certain kind of algebraic proof—which covers essentially all known algebraic circuit lower bounds to date—cannot be used to prove lower bounds against VP if and only if what we call succinct hitting sets exist for VP. This is analogous to the Razborov–Rudich natural proofs barrier in Boolean circuit complexity, in that we rule out a large class of lower bound techniques under ...
متن کاملComplexity of Matrix Multiplication and Bilinear Problems
Algebraic complexity theory is the study of computation using algebraic models. One of the main achievements of this field has been the introduction of methods to prove lower bounds on the computational complexity, in algebraic models of computation, of concrete problems. Another major achievement has been the development of powerful techniques to construct fast algorithms for computational pro...
متن کاملAn introduction to geometric complexity theory
I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
متن کامل7 On P vs . NP , Geometric Complexity Theory , and The Flip I : a high - level view Dedicated to Sri
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IBM Journal of Research and Development
دوره 25 شماره
صفحات -
تاریخ انتشار 1981